Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms

نویسنده

  • N. Tzanakis
چکیده

1. Introduction. In [Z], Zagier describes several methods for explicitly computing (large) integral points on models of elliptic curves defined over Q. Here we are interested in the computation of all integral points on a given Weierstraß equation for an elliptic curve E/Q, but not merely by reducing the original diophantine equation to an equivalent finite set of Thue equations which are subsequently solved by elementary, algebraic or analytic methods (see [TdW] and [STz]). On the contrary, we adopt a more natural approach, one in which the linear (group) relation between an integral point and the generators of the free component of the Mordell–Weil group is directly transformed into a linear form in elliptic logarithms. This idea is To make it work, that is to say, in order to produce upper bounds for the coefficients in the original linear (group) relation, one needs an effective lower bound for the linear form in elliptic logarithms. First to obtain such lower bounds were D. W. Masser [Ma, App. IV], in the case of elliptic curves with complex multiplication, and G. Wüstholz [Wu]; see also the bibliography in [H]. We felt that the recent result of N. Hirata-Kohno [H, Coroll. 2.16] should serve our purpose best. Unfortunately, this result, being rather more general than we required, though effective, is not completely explicit. At our request, S. David kindly undertook the highly non-trivial task of making explicit the special case we needed. It is S. David's result [D, Th. 2.1] that is applied here for the first time to provide explicit upper bounds for the coefficients in the linear (group) relation corresponding to a given Weierstraß equation. We shall show by example that these bounds may be reduced to manageable proportions. In the following sections we shall give a detailed description of the method referred to above. In the final section we present two examples, worked out in detail, of elliptic curves taken from the literature. Our choice

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Elliptic Diophantine Equations by Estimating Linear Forms in Elliptic Logarithms

In order to compute all integer points on a Weierstraß equation for an elliptic curve E/Q, one may translate the linear relation between rational points on E into a linear form of elliptic logarithms. An upper bound for this linear form can be obtained by employing the Néron-Tate height function and a lower bound is provided by a recent theorem of S. David. Combining these two bounds allows for...

متن کامل

Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms

This research was supported by the Netherlands Mathematical Research Foundation SWON with nancial aid from the Netherlands Organization for Scienti c Research NWO. We determine the solutions in integers of the equation y = (x + p)(x + p) for p = 167, 223, 337, 1201. The method used was suggested to us by Yu. Bilu, and is shown to be in some cases more efficient than other general purpose method...

متن کامل

On a Few Diophantine Equations, in Particular, Fermat’s Last Theorem

This is a survey on Diophantine equations, with the purpose being to give the flavour of some known results on the subject and to describe a few open problems. We will come across Fermat’s last theorem and its proof by Andrew Wiles using the modularity of elliptic curves, and we will exhibit other Diophantine equations which were solved à la Wiles. We will exhibit many families of Thue equation...

متن کامل

Asymptotically Fast Discrete Logarithms in Quadratic Number Fields

This article presents algorithms for computing discrete logarithms in class groups of quadratic number elds. In the case of imaginary quadratic elds, the algorithm is based on methods applied by Hafner and McCurley HM89] to determine the structure of the class group of imaginary quadratic elds. In the case of real quadratic elds, the algorithm of Buchmann Buc89] for computation of class group a...

متن کامل

Elliptic binomial diophantine equations

The complete sets of solutions of the equation (n k ) = (m ` ) are determined for the cases (k, `) = (2, 3), (2, 4), (2, 6), (2, 8), (3, 4), (3, 6), (4, 6), (4, 8). In each of these cases the equation is reduced to an elliptic equation, which is solved by using linear forms in elliptic logarithms. In all but one case this is more or less routine, but in the remaining case ((k, `) = (3, 6)) we h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994